package com.dyz.leetcode;

public class MaxDepth104 {
    //递归，求左右子树的高度
    public int maxDepth(TreeNode root) {
        if(root==null){return 0;}
        int left = maxDepth(root.left);
        int right = maxDepth(root.right);

        return Math.max(left,right)+1;
    }
}
